Hamiltonian Paths in Some Classes of Grid Graphs
نویسندگان
چکیده
The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.
منابع مشابه
Hamiltonian Paths in Two Classes of Grid Graphs
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in L−alphabet and C−alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
متن کاملHamiltonian Paths in C-shaped Grid Graphs
One of the well-known NP-complete problems in graph theory is the Hamiltonian path problem; i.e., finding a simple path in the graph such that every vertex visits exactly once [5]. The two-dimensional integer grid G is an infinite undirected graph in which vertices are all points of the plane with integer coordinates and two vertices are connected by an edge if and only if the Euclidean distanc...
متن کاملSqueeze-free Hamiltonian Paths in Grid Graphs
Motivated by multi-robot construction systems, we introduce the problem of finding squeeze-free Hamiltonian paths in grid graphs. A Hamiltonian path is squeeze-free if it does not pass between two previously visited vertices lying on opposite sides. We determine necessary and sufficient conditions for the existence of squeeze-free Hamiltonian paths in staircase grid graphs. Our proofs are const...
متن کاملUnit-length embedding of cycles and paths on grid graphs
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid graphs. We give the necessary and sufficient conditions for the existence of cycles of given length k and paths of given length k between two given vertices ...
متن کاملEnumerating Hamiltonian Cycles
A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king’s graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published. The approach can easily be modified to enumerate hamiltonian paths and other similar structures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012